Tiling Transactions in Rewriting Logic

نویسندگان

  • Roberto Bruni
  • José Meseguer
  • Ugo Montanari
چکیده

We propose a modular high-level approach to the specification of transactions in rewriting logic, where the operational and the abstract views are related by suitable adjunctions between categories of tile theories and of rewrite theories.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tiling transactions in rewriting logic 1 Roberto Bruni

We propose a modular high-level approach to the specification of transactions in rewriting logic, where the operational and the abstract views are related by suitable adjunctions between categories of tile theories and of rewrite theories.

متن کامل

Designing an Intelligent Intrusion Detection System in the Electronic Banking Industry Using Fuzzy Logic

One of the most important obstacles to using Internet banking is the lack of Stability of transactions and some misuse in the course of transactions it is financial. That is why preventing unauthorized access Crime detection is one of the major issues in financial institutions and banks. In this article, a system of intelligence has been designed that recognizes Suspicious and unusual behaviors...

متن کامل

Regional Languages and Tiling: A Unifying Approach to Picture Grammars

Several classical models of picture grammars based on array rewriting rules can be unified and extended by a tiling based approach. The right part of a rewriting rule is formalized by a finite set of permitted tiles. We focus on a simple type of tiling, named regional, and define the corresponding regional tile grammars. They include both Siromoney’s (or Matz’s) Kolam grammars, and their genera...

متن کامل

Picture languages: Tiling systems versus tile rewriting grammars

Two formal models of pictures, i.e., 2D languages are compared: Tiling Systems and Tile Rewriting Grammars, which resp. extend to 2D the Regular and Context-Free languages. Two results extending classical language properties into 2D are proved. First, non-recursive TRG coincide with TS. Second, non-self-embedding TRG are suitably defined as corner grammars, showing that they generate TS languag...

متن کامل

A Graph Rewriting Approach for Converting Asynchronous ROMs into Synchronous Ones

Most of FPGAs have Configurable Logic Blocks (CLBs) to implement combinational and sequential circuits and block RAMs to implement Random Access Memories (RAMs) and Read Only Memories (ROMs). Circuit design that minimizes the number of clock cycles is easy if we use asynchronous read operations. However, most of FPGAs support synchronous read operations, but do not support asynchronous read ope...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 71  شماره 

صفحات  -

تاریخ انتشار 2002